Multiple-prototype classifier design

نویسندگان

  • James C. Bezdek
  • Thomas Reichherzer
  • Sok Gek Lim
  • Yianni Attikiouzel
چکیده

Five methods that generate multiple prototypes from labeled data are reviewed. Then we introduce a new sixth approach, which is a modification of Chang’s method. We compare the six methods with two standard classifier designs: the 1nearest prototype (1-np) and 1-nearest neighbor (1-nn) rules. The standard of comparison is the resubstitution error rate; the data used are the Iris data. Our modified Chang’s method produces the best consistent (zero errors) design. One of the competitive learning models produces the best minimal prototypes design (five prototypes that yield three resubstitution errors).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Differential Evolution Based Multiple Vector Prototype Classifier

In this article we introduce differential evolution based multiple vector prototype classifier (shortly MVDE). In this method we extend the previous DE classifier so that it can handle several class vectors in one class. Classification problems which are so complex that they are simply not separable by using distance based algorithms e.g. differential evolution (DE) classifier or support vector...

متن کامل

Prototype Based Classifier Design with Pruning

An algorithm is proposed to prune the prototype vectors (prototype selection) used in a nearest neighbor classifier so that a compact classifier can be obtained with similar or even better performance. The pruning procedure is error based; a prototype will be pruned if its deletion leads to the smallest classification error increase. Also each pruning iteration is followed by one epoch of Learn...

متن کامل

Presupervised and post-supervised prototype classifier design

We extend the nearest prototype classifier to a generalized nearest prototype classifier (GNPC). The GNPC uses "soft" labeling of the prototypes in the classes, thereby encompassing a variety of classifiers. Based on how the prototypes are found we distinguish between presupervised and postsupervised GNPC designs. We derive the conditions for optimality (relative to the standard Bayes error rat...

متن کامل

Prototype-based Classifier with Feature Selection and Its Design with Particle Swarm Optimization: Analysis and Comparative Studies

In this study, we introduce a prototype-based classifier with feature selection that dwells upon the usage of a biologically inspired optimization technique of Particle Swarm Optimization (PSO). The design comprises two main phases. In the first phase, PSO selects P % of patterns to be treated as prototypes of c classes. During the second phase, the PSO is instrumental in the formation of a cor...

متن کامل

Multi-hypothesis nearest-neighbor classifier based on class-conditional weighted distance metric

The performance of nearest-neighbor (NN) classifiers is known to be very sensitive to the distance metric used in classifying a query pattern, especially in scarce-prototype cases. In this paper, a classconditional weighted (CCW) distance metric related to both the class labels of the prototypes and the query patterns is proposed. Compared with the existing distance metrics, the proposed metric...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Systems, Man, and Cybernetics, Part C

دوره 28  شماره 

صفحات  -

تاریخ انتشار 1998